spanning tree algorithm
英 [ˈspænɪŋ triː ˈælɡərɪðəm]
美 [ˈspænɪŋ triː ˈælɡərɪðəm]
网络 生成树算法; 天生树算法; 算法; 生成樹演算法; 生成树
双语例句
- Distribution Network Comprehensive Optimization Based on Minimum Spanning Tree Algorithm and Improved Genetic Algorithms
基于最小生成树算法和改进遗传算法的配电网络综合优化 - Based on spanning tree algorithm that is suitable to data fusion, the principle and features of Minimum Cost Spanning Tree ( MCST) is analyzed.
在适合数据融合的生成树算法的基础上，分析能够有效延长网络生命的最小代价生成树路由协议的原理和特点。 - Study of Minimum Spanning Tree Routing Algorithm in LEACH
基于最小生成树的LEACH路由算法研究 - Image edge detection using new weighted entropy minimal spanning tree algorithm
最小加权熵支撑树图像边缘提取方法 - Compensatory cost spanning tree routing algorithm for wireless sensor networks
无线传感器网络补偿性代价生成树路由算法 - Zero Initialization of Spatial Data and Minimum Spanning Tree Algorithm in Presence of Arbitrary Obstacles
空间数据的零初始化与障碍空间下的最小生成树实现方法 - A new real-time reconfiguration approach for large-scale distribution system, based on the minimum spanning tree algorithm and the switch exchange method, is presented.
提出了一种利用最小树算法和开关交换方法进行大规模配电网重构的新方法。 - Aiming at the defect of IEEE 802.1D algorithm for slow convergence speed, the principle of improved Propagation Order Spanning Tree algorithm and the mechanism of quick fault detection and fault recovery are discussed as well as the evaluation of this algorithm.
针对IEEE802.1D算法收敛慢的缺陷，本文提出一种改进的基于传播顺序生成树算法实现快速故障探测与自恢复的方法，并给出了该算法的性能评估。 - A Minimum Delay Spanning Tree Algorithm for the Application-Layer Multicast
应用层组播的最小延迟生成树算法 - In the case of all loads being single condition loads, the weights of the edges are determined by the second order moments of the corresponding currents passing through the edges, on this basis the optimal planning is obtained by use of improved minimum-cost spanning tree based algorithm.
对于所有负荷都是单条件负荷的情形，根据流过各条边的电流的二阶原点矩确定各条边的权，在此基础上利用改进最小生成树算法获得最优规划方案。 - Formal Derivation of the Minimum Spanning Tree Algorithm with PAR Method
最小生成树算法的PAR方法形式化推导 - Data structure based Minimum spanning tree algorithm
基于数据结构的最小生成树算法 - Optimal distribution network planning based on improved minimal cost spanning tree algorithm and considering indeterminacy of power loads
基于改进最小生成树算法并考虑负荷不确定性的配电网架最优规划 - At first the spanning tree algorithm is used to find quickly an initial feasible solution for the network minimal, cost flow. Then the network simplex method is applied to get the optimal solution of the minimal cost flow.
本文先用生成树算法，迅速找到一个网络最小费用流的可行初始解，然后再用网络的单纯形解法，得出最小费用流的最优解。 - This paper presents an extended double list storage structure based on a double list storage structure and then applies it to the minimum spanning tree algorithm.
在图的一种双链式存储结构的基础上提出了一种扩展的双链式存储结构。 - The Spanning Tree Algorithm for Minimal Cost Flow
最小费用流的生成树算法 - In the sketch map having been reduced, all the file spanning tree s can span by using the new file spanning tree algorithm, so all the transmission paths of each data file can make sure by the file transmission path algorithm.
在精简的分布式系统示意图中，运用新的文件生成树生成算法，生成执行程序的所有文件生成树，以便确定数据文件的所有传输路径； - Switches in switched Ethernet running spanning tree algorithm will organize a spanning tree top structure to guarantee a unique communication link between any two switches.
运行生成树算法的由交换机组成的通信系统会组成一个生成树动态拓扑结构，该拓扑结构使局域网内任意两个交换机之间不存在回路，以防止由此产生的局域网广播风暴。 - Minimum Spanning Tree Algorithm Based on Extended Double List Storage Structure
基于扩展双链式存储结构的最小生成树算法 - These algorithms include Degree-1 reduction algorithm, Series reduction algorithm, new file spanning tree algorithm, file transmission path algorithm and response time of file transmission path algorithm.
在此基础上，推导出Degree-1精简算法、Series精简算法、新的文件生成树生成算法、文件传输路径生成算法以及响应时间评估算法。 - A multi-stage planning approach considering uncertainty is put forward based on improved minimum-cost spanning tree algorithm.
为了在规划过程中考虑负荷的不确定性，提出了一种基于改进最小生成树算法的多阶段不确定性规划方法。 - According to the topology of website, this paper presents the spanning tree algorithm of website structure for information extraction.
从网站的拓扑结构入手，提出了信息抽取中网站结构树的生成算法，该算法首先根据网页结点URL所在目录的层次关系，去掉网站结构图中的部分回溯边； - A Minimum Spanning Tree Algorithm for Solving the Transportation Problem
运输问题的最小生成树算法 - The multicast routing algorithm is based on Prim's MST ( Minimum Spanning Tree) algorithm and K-restricted breadth-first search method, which can produce a sub-minimal cost tree under a given delay bound.
组播路由算法以Prim最小生成树算法和K-度宽度优先搜索方法为基础，生成一棵满足给定延迟时限的最小成本树。 - First, this paper analyzes degree-constraint minimum diameter spanning tree algorithm – the CT algorithm, and proposes the improved CT algorithm.
首先，本文有效的分析了度受限的最小直径生成树算法-CT算法，并提出了改进的CT算法。 - Spanning tree algorithm is adopted to direct search process of Ant Colony Algorithm.
采用生成树算法来指导蚁群算法的搜索过程。 - First, we proposed the largest single point of minimum spanning tree algorithm and analysis of the complexity of the algorithm. Complexity of the algorithm is 2 Ο( n).
首先给出了单点最大度约束最小树算法并分析了该算法的复杂度，该算法的复杂度为Ο（n2）。 - Finally, through the proving of the correctness of this algorithm, a conclusion has been obtained that the bottom-up Minimum-Degree Spanning Tree algorithm is a first solution for the initial configuration of Degree-constrained Free Space Optical ( FSO) networks.
最后通过对算法的正确性论证，得出对于度受限的FSO网络初始化，自下而上最小度生成树算法是首选方法。 - According to RPC node graph spanning tree algorithm, proposed human body posture estimation algorithm for video, and RPC-based spanning tree model inference algorithm.
根据RPC节点图生成树算法，提出了视频人体姿态估计算法，和基于RPC生成树模型的推理算法。 - And put forward relevant actions based on the movement of the cluster model, in order to reduce the search space, spanning tree algorithm proposed RPC node graph, and refinement of the merger of RPC nodes, node splitting and spanning tree balancing algorithm.
并提出了基于相关动作簇的运动模型，为了缩减搜索空间，提出RPC节点图生成树算法，并细化了RPC的节点合并，节点分裂和生成树平衡算法。